Integer Linear Programming-Based Scheduling for Transport Triggered Architectures

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Optimizing Enterprise Architectures Using Linear Integer Programming Techniques

Within this paper, we present a technique to optimize the relations between two adjacent layers of Enterprise Architectures (EA). Therefore, we suggest to interpret the constraints between these two layers as triangles, where a needed capability of an upper layer element is realized by a lower layer element. This eases the communication of the optimization model e.g. to the management. Moreover...

متن کامل

Integer Linear Programming-Based Bit-Level Optimization for High-Speed FIR Decimation Filter Architectures

Analog-to-digital converters based on sigma-delta modulation have shown promising performance, with steadily increasing bandwidth. However, associated with the increasing bandwidth is an increasing modulator sampling rate, which becomes costly to decimate in the digital domain. Several architectures exist for the digital decimation filter, and among the more common and efficient are polyphase d...

متن کامل

preventive maintenance scheduling with integer programming and constraint programming

preventive maintenance scheduling is to perform a series of tasks that prevents or minimizes production breakdowns and improves the reliability. mathematical models have been developed to solve the preventive maintenance scheduling problem. there are several limitations in the prior work in this area of research. craft combinations are assumed to be given. the craft combination problem concerns...

متن کامل

An integer linear programming approach for bilinear integer programming

We introduce a new Integer Linear Programming (ILP) approach for solving Integer Programming (IP) problems with bilinear objectives and linear constraints. The approach relies on a series of ILP approximations of the bilinear IP. We compare this approach with standard linearization techniques on random instances and a set of real-world product bundling problems.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: ACM Transactions on Architecture and Code Optimization

سال: 2016

ISSN: 1544-3566,1544-3973

DOI: 10.1145/2845082